Multi-valued version of S C C , S K C , K S C , and C S C conditions in Ptolemy metric spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

T C C S,     

We discuss session types independently of any programming language. We then embody the notion in languages from three different paradigms: the pi calculus, a functional language, and an object-oriented language.

متن کامل

T L  C S C W S?

Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far away planet. Would their mathematics be setbased? What are the alternatives to the set-theoretic foundation of mathematics? Besides, set theory seems to play a significant role in computer science, in particular in database the...

متن کامل

T L  C S C B  C

In a computational process, certain entities (for example sets or arrays) and operations on them may be automatically available, for example by being provided by the programming language. We define background classes to formalize this idea, and we study some of their basic properties. The present notion of background class is more general than the one we introduced in an earlier paper, and it t...

متن کامل

T L  C S C

In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ordered quantifiers [19]. After defining a gametheoretic semantics for these objects, we observe that tuning the parameter of absentmindedness gives rise to quantifier prefixes studied in [28]. In the interest of computation, we characterize the complexity class PNP q in terms of partially ordered q...

متن کامل

T C C C Beatcs No 109 S C: W M P G S?

The design of efficient algorithms for planar graphs, as a field of research, is over forty year old and continues to be an exciting area. There are several new efficient algorithms for a variety of graph optimization problems that exploit planarity and, in general, the structure of low genus graphs and graphs with excluded minors. Efficient space-bounded computations, on the other hand, involv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Inequalities and Applications

سال: 2014

ISSN: 1029-242X

DOI: 10.1186/1029-242x-2014-471